Inductive Inference for Solving Divergence in Knuth-Bendix Completion
نویسندگان
چکیده
The Knuth-Bendix completion procedure generates a confluent set of rewrite rules by repeatedly superposing left hand sides of rewrite rules and adding any generated critical pairs as new rewrite rules. The process may terminate in two ways; with success: there are no more (nontrivial) critical pairs, or with failure: a critical pair is generated which cannot be oriented by the ordering. The process is said to diverge if it does not terminate at all.
منابع مشابه
Solving Divergence in Knuth-Bendix Completion by Enriching Signatures
Thomas, M. and P. Watson, Solving divergence in Knuth-Bendix completion by enriching signatures. Theoretical Computer Science 112 (1993) 145-185. The Knuth-Bendix completion algorithm is a procedure which generates confluent and terminating sets of rewrite rules. The algorithm has many applications: the resulting rules can be used as a decision procedure for equality or, in the case of program ...
متن کاملAbstract Reduction Systems and Idea of Knuth-Bendix Completion Algorithm
Reduction Systems and Idea of Knuth-Bendix Completion Algorithm Grzegorz Bancerek Association of Mizar Users Białystok, Poland Summary. Educational content for abstract reduction systems concerning reduction, convertibility, normal forms, divergence and convergence, ChurchRosser property, term rewriting systems, and the idea of the Knuth-Bendix Completion Algorithm. The theory is based on [1].
متن کاملTowards a Foundation of Completion Procedures as Semidecision Procedures
Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for equational theories. In this paper we present a new abstract framework for the utilization of completion procedures as semidecision procedures for theorem proving. The key idea in our approach is that a semidecision proce...
متن کاملA Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix Ordering
We show the decidability of the existential theory of term algebras with any Knuth-Bendix ordering by giving a procedure for solving Knuth-Bendix ordering constraints.
متن کاملKBlab: An Equational Theorem Prover for the Macintosh
KBlab is a Completion based theorem prover for equational logic, written in the language C and developed on the Macintosh in the MPW (Macintosh Programmer Workshop) programming environment. The core of KBlab is the Knuth–Bendix Completion Procedure (KB) [9,7,1], extended to Unfailing Knuth– Bendix (UKB) [5], S–strategy [5] and inductive theorem proving (IKB). IKB implements the Huet–Hullot meth...
متن کامل